A Finite Alternation Result for Reversible Boolean Circuits
نویسنده
چکیده
We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n − 1 bits or on the bottom n− 1 bits. We show that every reversible boolean function of n > 4 bits has alternation depth 9.
منابع مشابه
On Computation and Random Strings
2 Preliminaries 2 2.1 Strings and Languages . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Turing Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Recognizers and Deciders . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Alternation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.5 Complexity Classes . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملMore on Computing Boolean Functions by Sparse Real Polynomials and Related Types of Threshold Circuits
In this paper we investigate the computational power of threshold{ AND circuits versus threshold{XOR circuits. Starting from the observation that small weight threshold{AND circuits can be simulated by small weight threshold{XOR circuits we pose the question whether a Supported by the grant A1019602 of the Academy of Sciences of the Czech Republic. A major part of the results were obtained whil...
متن کاملTowards an Algebraic Theory of Boolean Circuits
Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits have been introduced to modelize some physical aspects of computation. Those notions are essential in complexity theory, but we claim that a deep mathematical theory is needed to make progress in this area. For that purpose, the recent developments of knot theory is a major s...
متن کامل